The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing
نویسندگان
چکیده
منابع مشابه
L∞ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing
In this paper we address the L∞ Voronoi diagram of polygonal objects and present applications in VLSI layout and manufacturing. We show that in L∞ the Voronoi diagram of segments consists only of straight line segments and is thus much simpler to compute than its Euclidean counterpart. Moreover, it has a natural interpretation. In applications where Euclidean precision is not particularly impor...
متن کاملThe L∞ Hausdorff Voronoi Diagram Revisited
We revisit the L∞ Hausdorff Voronoi diagram of clusters of points, equivalently, the L∞ Hausdorff Voronoi diagram of rectangles, and present a plane sweep algorithm for its construction that generalizes and improves upon previous results. We show that the structural complexity of the L∞ Hausdorff Voronoi diagram is Θ(n+m), where n is the number of given clusters and m is the number of essential...
متن کاملThe Higher Order Hausdorff Voronoi Diagram and Vlsi Critical Area Extraction for Via-blocks
We extend the Voronoi diagram framework to compute the critical area of a circuit layout [15, 12, 16, 13, 14] with the ability to accurately compute critical area for via-blocks on via and contact layers in the presence of multilayer loops, redundant vias, and redundant interconnects. Critical area is a measure reflecting the sensitivity of a VLSI design to random defects during IC manufacturin...
متن کاملThe hausdorff voronoi diagram of polygonal objects: a divide and conquer approach
We study the Hausdorff Voronoi diagram of a set S of polygonal objects in the plane, a generalization of Voronoi diagrams based on the maximum distance of a point from a polygon, and show that it is equivalent to the Voronoi diagram of S under the Hausdorff distance function. We investigate the structural and combinatorial properties of the Hausdorff Voronoi diagram and give a divide and conque...
متن کاملNet-aware Critical Area extraction for VLSI opens via Voronoi diagrams
We address the problem of computing critical area for opens in a circuit layout in the presence of loops and redundant interconnects. The extraction of critical area is the main computational problem in VLSI yield prediction for random manufacturing defects. Our approach first models the problem as a graph problem and solves it efficiently by exploiting its geometric nature. The approach expand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002